Combinatorial optimization algorithms for radio network planning
نویسندگان
چکیده
منابع مشابه
Combinatorial optimization algorithms for radio network planning
This paper uses a realistic problem taken from the telecommunication world as the basis for comparing di.erent combinatorial optimization algorithms. The problem recalls the minimum hitting set problem, and is solved with greedy-like, Darwinism and genetic algorithms. These three paradigms are described and analyzed with emphasis on the Darwinism approach, which is based on the computation of -...
متن کاملRadio Network Planning with Combinatorial Optimisation Algorithms
Abstract: Future UMTS radio planning engineers will face difficult problems due to the complexity of the system and the size of these networks. In the STORMS project, a software for the optimisation of the radio network is under development. Two mathematical models of the radio planning problem are proposed. Two software prototypes based on these models are described with the first experimental...
متن کاملOptimization Methods for UMTS Radio Network Planning
The UMTS radio network planning problem poses the challenge of designing a cost-effective network that provides users with sufficient coverage and capacity. We describe an optimization model for this problem that is based on comprehensive planning data of the EU project Momentum. We present heuristic mathematical methods for this realistic model, including computational results.
متن کاملOptimization models and algorithms for downlink UMTS radio planning
Abstract— The problem of planning third generation UMTS networks with a W-CDMA radio interface is investigated. In previous work [2]–[4] we have proposed discrete optimization models and algorithms for supporting the decisions on where to locate base stations and which antenna configuration to select considering quality constraints for the uplink (mobile to base station) direction. The Signal-t...
متن کاملSoftmax to Softassign: Neural Network Algorithms for Combinatorial Optimization
A new technique termed softassign, is applied to three combinatorial optimization problems|weighted graph matching, the traveling salesman problem and graph partitioning. Softassign, which has emerged from the recurrent neural network/statistical physics framework, enforces two-way (assignment) constraints without the use of penalty terms in the energy functions. The softassign can also be gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00245-0